Regular Algebra Applied to Path - finding Problems
نویسنده
چکیده
In an earlier paper, one of the authors presented an algebra for formulating and solving extremal path problems. There are striking similarities between that algebra and the algebra of regular languages, which lead one to consider whether the previous results can be generalized—for instance to path enumeration problems—and whether the algebra of regular languages can itself be profitably used for the general study of path-finding problems. This paper gives affirmative answers to both these questions.
منابع مشابه
Implementations of routing algorithms for transportation networks
We discuss the generalization of the point-to-point (and single-source) shortest path problem to instances where the shortest path must satisfy a formal language constraint. We describe theoretical and experimental results on a generalization of Dijkstra’s algorithm to finding regular-language-constrained shortest paths. This algorithm forms a model for single-source shortest paths and point-to...
متن کاملFormal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , we consider the problem of finding a shortest (simple) path p in G complying with the additional constraint that l(p) 2 L. Here l(p) denotes the unique word given by concatenating the -labels of the edges along the path p. The main contributions of this paper include the following: 1. We sh...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملCALCULATING A PATH ALGORITHMRoland
A calculational derivation is given of an abstract path algorithm, one instance of the algorithm being Dijkstra's shortest-path algorithm, another being breadth-rst/depth-rst search of a directed graph. The basis for the derivation is the algebra of regular languages. Given is a (non-empty) set N and a j N j j N j matrix A, the rows and columns of which are indexed by elements of N. It is assum...
متن کاملFlight Planning in Free Route Airspaces
We consider the problem of finding cheapest flight routes through free route airspaces in a 2D setting. We subdivide the airspace into regions determined by a Voronoi subdivision around the points from a weather forecast. This gives rise to a regular grid of rectangular regions (quads) with every quad having an associated vector-weight that represents the wind magnitude and direction. Finding a...
متن کامل